基于粗集和最大熵的模式识别方法

用基于属性约简的粗集理论找出条件属性的最小属性集。对属性间为不确定因果关系的模式,计算在最大熵情况下发生的概率,通过比较概率来进行模式识别,实例分析和结论部分说明这种方法是有效的。     

最大生存概率下的编队防空目标分配研究

为研究编队目标武器分配方法,分析了编队防空体系在作战过程中武器系统火力单元状态、分配决策矩阵和目标序列状态的动态更新形式,建立了以编队生存概率最大为最优函数的动态目标分配优化模型。描述了仿真环境,运用不确定目标序列对分配过程进行了仿真。结果表明,所建立的模型能够反映实际情况,得到的关于集火、转火射击和优先分配策略对模型的工程应用具有实际指导意义。     

Double Mover–Stayer model on customer switching in telecommunications industry

Customer acquisition and customer retention are the most important challenges in the increasingly competitive telecommunications industry. Traditional studies of customer switching always assume that customers are homogeneous, and thus that model customer switching behavior follows a Markov formulation. However, this postulation is obviously inappropriate in most instances. Blumen et al. (Cornell Studies of Industrial and Labor Relations, Cornell University Press, Ithaca, NY, 1955) developed the Mover–Stayer (MS) model, a generalization of the Markov chain model, to relax the requirement of homogeneity and allow the presence of heterogeneity with two different types of individuals—“stayers,” who purchase the same kinds of products or services throughout the entire observation period; and “movers,” who look for variety in products or services over time. There are two purpose of this article. First, we extend the MS model to a Double Mover‐Stayer (DMS) model by assuming the existence of three types of individuals in the market: (1) stable and loyal customers, who have stable usage within the same company; (2) instable but loyal customers, whose usage varies within the same company over time; and (3) disloyal customers, who switch from one company to another to seek for new experiences or/and benefits. We also propose an estimation method for the DMS model. Second, we apply the DMS model to telecommunications data and demonstrate how it can be used for pattern identification, hidden knowledge discovery, and decision making. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

多源信息的验前分布融合方法研究

验前分布的获取和表示是B ayes理论应用中的一个关键问题。针对目前多源验前信息融合中存在的过分依赖专家信息的问题,提出了一种基于第2类极大似然估计原理(M L-II)确定验前分布权重的方法,该方法将现场试验数据看作是由其边缘分布产生的样本,然后根据不同验前分布下现场样本似然性的大小来确定其在验前分布融合中的作用,并以此进一步确定不同验前分布的权重因子。最后通过算例证明了该方法比基于专家信息的融合方法更为合理和有效。     

机载雷达与地面雷达的最大似然配准算法

空、地多雷达配准是空地一体化预警的前提。通过建立空中运动雷达与地面静止雷达的配准模型,以最大似然算法为基础,导出其空间系统误差配准参数及目标运动状态估计的具体公式,并对系统误差估计值的卡拉美-罗界进行了讨论。仿真结果表明,该算法具有较快的迭代收敛速度和较好的配准效果。     

On‐line parameter estimation for a partially observable system subject to random failure

In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

正规模糊测度空间上的条件期望

讨论了次可加、具有有界变差的正规模糊测度空间上关于模糊测度、内测度及模糊积分的性质，在此基础上定义了此模糊测度空间上随机变量的条件数学期望，它是相对于经典测度空间的一个推广。     

基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

长管水击最大水击压强的解析

从管道水击微分方程的特征分析入手,提出了水击特征方程的黎曼不变量和网格分析解,建立了管道水击问题的近似解析解,给出了长管水击最大水击压强的计算表达式。通过实际算例对解析解和数值解结果进行了比较。对水击微分方程的重力项也进行了讨论。     

A new importance sampling Monte Carlo method for a flow network reliability problem

The exact evaluation of the probability that the maximum st‐flow is greater than or equal to a fixed demand in a stochastic flow network is an NP‐hard problem. This limitation leads one to consider Monte Carlo alternatives. In this paper, we propose a new importance sampling Monte Carlo method. It is based on a recursive use of the state space decomposition methodology of Doulliez and Jamoulle during the simulation process. We show theoretically that the resulting estimator belongs to the variance‐reduction family and we give an upper bound on its variance. As shown by experimental tests, the new sampling principle offers, in many cases, substantial speedups with respect to a previous importance sampling based on the same decomposition procedure and its best performances are obtained when highly reliable networks are analyzed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 204–228, 2002; DOI 10.1002/nav.10004